A study of the robustness of the group scheduling method using an emulation of a complex FMS

نویسندگان

  • Olivier Cardin
  • Nasser Mebarki
  • Guillaume Pinot
چکیده

In the field of predictive–reactive scheduling methods, group sequencing is reputed to be robust (in terms of uncertainties absorption) due to the flexibility it adds with regard to the sequence of operations. However, this assumption has been established on experiments made on simple theoretical examples. The aim of this paper is to carry out experimentation on a complex flexible manufacturing system in order to determine whether or not the flexibility of the group scheduling method can in fact absorb uncertainties. In the study, transportation times of parts between machines are considered as uncertain. Simulation studies have been designed in order to evaluate the relationship between flexibility and the ability to absorb uncertainties. Comparisons are made between schedules generated using the group sequencing method with different flexibility levels and a schedule with no flexibility. This last schedule takes into account uncertainties whereas schedules generated using the group sequencing method do not. As it is the best possible schedule, it provides a lower bound and enables to calculate the degradation of performance of calculated schedules. The results show that group sequencing perform very well, enabling the quality of the schedule to be improved, especially when the level of uncertainty of the problem increases. The results also show that flexibility is the key factor for robustness. The rise in the level of flexibility increases the robustness of the schedule towards the uncertainties. & 2013 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Role of batch size in scheduling optimization of flexible manufacturing system using genetic algorithm

Flexible manufacturing system (FMS) readily addresses the dynamic needs of the customers in terms of variety and quality. At present, there is a need to produce a wide range of quality products in limited time span. On-time delivery of customers’ orders is critical in make-to-order (MTO) manufacturing systems. The completion time of the orders depends on several factors including arrival rate, ...

متن کامل

A Scheduling Model of Flexible Manufacturing System to Reduce Waste and Earliness/Tardiness Penalties

Nowadays, flexible manufacturing system (FMS) is introduced as a response to the competitive environment. Scheduling of FMS is more complex and more difficult than the other scheduling production systems. One of the main factors in scheduling of FMS is variable time of taking orders from customers, which leads to a sudden change in the manufacturing process. Also, some problems are created in p...

متن کامل

Multi-objective optimization of time-cost-quality-carbon dioxide emission-plan robustness in construction projects

Today, the construction industry is facing intense competition and success in this competition depends on several factors. Project managers try to minimize project time and cost, carbon dioxide emission and at the same time maximizing the quality of project and its plan robustness. In this paper, study construction project scheduling considering a discrete trade-off between time, cost, quality,...

متن کامل

An Optimal Preventive Maintenance Model to Enhance Availability and Reliability of Flexible Manufacturing Systems

General preventive maintenance model for the components of a system, which improves the reliability to ‘as good as new,’ was used to optimize the maintenance cost. The cost function of a maintenance policy was minimized under given availability constraint. On the other hand, in order to ensure appropriate reliability and availability, the development of the optimal maintenanc...

متن کامل

Real-time Scheduling of a Flexible Manufacturing System using a Two-phase Machine Learning Algorithm

The static and analytic scheduling approach is very difficult to follow and is not always applicable in real-time. Most of the scheduling algorithms are designed to be established in offline environment. However, we are challenged with three characteristics in real cases: First, problem data of jobs are not known in advance. Second, most of the shop’s parameters tend to be stochastic. Third, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015